11 research outputs found
A Random Access Protocol for RIS-Aided Wireless Communications
Reconfigurable intelligent surfaces (RISs) are arrays of passive elements
that can control the reflection of the incident electromagnetic waves. While
RIS are particularly useful to avoid blockages, the protocol aspects for their
implementation have been largely overlooked. In this paper, we devise a random
access protocol for a RIS-assisted wireless communication setting. Rather than
tailoring RIS reflections to meet the positions of users equipment (UEs), our
protocol relies on a finite set of RIS configurations designed to cover the
area of interest. The protocol is comprised of a downlink training phase
followed by an uplink access phase. During these phases, a base station (BS)
controls the RIS to sweep over its configurations. The UEs then receive
training signals to measure the channel quality with the different RIS
configurations and refine their access policies. Numerical results show that
our protocol increases the average number of successful access attempts;
however, at the expense of increased access delay due to the realization of a
training period. Promising results are further observed in scenarios with a
high access load.Comment: 5 pages, 2 figures, conference versio
How to Identify and Authenticate Users in Massive Unsourced Random Access
Identification and authentication are two basic functionalities of
traditional random access protocols. In ALOHA-based random access, the packets
usually include a field with a unique user address. However, when the number of
users is massive and relatively small packets are transmitted, the overhead of
including such field becomes restrictive. In unsourced random access (U-RA),
the packets do not include any address field for the user, which maximizes the
number of useful bits that are transmitted. However, by definition an U-RA
protocol does not provide user identification. This paper presents a scheme
that builds upon an underlying U-RA protocol and solves the problem of user
identification and authentication. In our scheme, the users generate a message
authentication code (MAC) that provides these functionalities without violating
the main principle of unsourced random access: the selection of codewords from
a common codebook is i.i.d. among all users